Non-locally coded Fourier-transform ghost imaging
نویسندگان
چکیده
منابع مشابه
Fourier-Transform Ghost Imaging with Hard X Rays.
Knowledge gained through x-ray crystallography fostered structural determination of materials and greatly facilitated the development of modern science and technology in the past century. However, it is only applied to crystalline structures and cannot resolve noncrystalline materials. Here we demonstrate a novel lensless Fourier-transform ghost imaging method with pseudothermal hard x rays tha...
متن کاملBirefringent Fourier-transform imaging spectrometer.
Fourier-transform imaging spectrometers offer important advantages over other spectral imaging modalities, such as, a wider free spectral range, higher spectral resolutions and, in low-photon-flux conditions, higher signal-to-noise ratios can be achieved. Unfortunately, for application in harsh environments, deployment of Fourier-transform instruments based on traditional moving-mirror interfer...
متن کاملFourier Transform Based Hyperspectral Imaging
A hyperspectral imaging system (HSIS) is a combination of an imaging device and a spectrometer. The result is a 2D image combined with the third dimension containing the spectral composition of each pixel of the image. Spectrometers normally implemented in hyperspectral imaging systems are made by integrating a dispersive means (a prism or a grating) in an optical system, with the drawback of h...
متن کاملNon-diffractive computational ghost imaging.
Computational ghost imaging (CGI) enables an image to be recorded using a single-pixel detector. The image can be reconstructed from correlations between the scene and a series of known projected intensity patterns. In this work we investigate the performance of CGI using pseudo non-diffracting (ND) speckle patterns. We demonstrate an extended depth-of-field that is ∼ 2-3 times greater than tha...
متن کاملFinding Significant Fourier Transform Coefficients Deterministically and Locally
Computing the Fourier transform is a basic building block used in numerous applications. For data intensive applications, even the O(N logN) running time of the Fast Fourier Transform (FFT) algorithm may be too slow, and sub-linear running time is necessary. Clearly, outputting the entire Fourier transform in sub-linear time is infeasible, nevertheless, in many applications it suffices to find ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optics Express
سال: 2019
ISSN: 1094-4087
DOI: 10.1364/oe.27.002937